Permutations, Cycles and the Pattern 2-13
نویسنده
چکیده
We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.
منابع مشابه
3 1 Ju l 2 00 6 Permutations , cycles , and the pattern 2 – 13
We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.
متن کاملLattice Path Enumeration of Permutations with k Occurrences of the Pattern 2 – 13
We count the number of permutations with k occurrences of the pattern 2–13 in permutations by lattice path enumeration. We give closed forms for k ≤ 8, extending results of Claesson and Mansour.
متن کاملPattern Matching in the Cycle Structures of Permutations
In this paper, we study pattern matching conditions in the cycle structures of permutations. We develop methods to find the joint distribution of the number of cycles and the number of cycle descents over the set of permutations in the symmetric group Sn which have no cycle occurrences or no consecutive cycle occurrences of a given pattern or set of patterns. Our methods also allow us to refine...
متن کاملUnimodal Permutations and Almost-Increasing Cycles
In this paper, we establish a natural bijection between the almost-increasing cyclic permutations of length n and unimodal permutations of length n − 1. This map is used to give a new characterization, in terms of pattern avoidance, of almostincreasing cycles. Additionally, we use this bijection to enumerate several statistics on almost-increasing cycles. Such statistics include descents, inver...
متن کاملCycles and Patterns in Permutations
We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating functions for inversions, ascents, descents, 123s, valleys, 1’-2-1s; closed forms for avoidance of peaks, 2-3-1s, 1-2-3s, 2’-1-2s and 1’-2-1s; bijective pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006